int FactorialSum(List L)
{
	int sum = 0;
	PtrToNode p = L;
	while (p != NULL)
	{
		//(P->Data)!
		int factorial = 1;
		for (int i = 1; i <= p->Data; i++)
		{
			factorial *= i;
		}
		sum += factorial;
		p = p->Next;
	}
	return sum;
}